Triangle-Free Triangulations, Hyperplane Arrangements and Shifted Tableaux
نویسندگان
چکیده
منابع مشابه
Triangle-Free Triangulations, Hyperplane Arrangements and Shifted Tableaux
Flips of diagonals in colored triangle-free triangulations of a convex polygon are interpreted as moves between two adjacent chambers in a certain graphic hyperplane arrangement. Properties of geodesics in the associated flip graph are deduced. In particular, it is shown that: (1) every diagonal is flipped exactly once in a geodesic between distinguished pairs of antipodes; (2) the number of ge...
متن کاملLower Central Series and Free Resolutions of Hyperplane Arrangements
If M is the complement of a hyperplane arrangement, and A = H(M, k) is the cohomology ring of M over a field of characteristic 0, then the ranks, φk, of the lower central series quotients of π1(M) can be computed from the Betti numbers, bii = dimTor A i (k, k)i, of the linear strand in a minimal free resolution of k over A. We use the Cartan-Eilenberg change of rings spectral sequence to relate...
متن کاملRandom Walk and Hyperplane Arrangements
Let C be the set of chambers of a real hyperplane arrangement. We study a random walk on C introduced by Bidigare, Hanlon, and Rockmore. This includes various shuuing schemes used in computer science, biology, and card games. It also includes random walks on zonotopes and zonotopal tilings. We nd the stationary distributions of these Markov chains, give good bounds on the rate of convergence to...
متن کاملBranched Polymers and Hyperplane Arrangements
We generalize the construction of connected branched polymers and the notion of the volume of the space of connected branched polymers studied by Brydges and Imbrie [BI], and Kenyon and Winkler [KW] to any hyperplane arrangement A. The volume of the resulting configuration space of connected branched polymers associated to the hyperplane arrangement A is expressed through the value of the chara...
متن کاملArtin groups and hyperplane arrangements
These are the notes of a mini-course given at the conference “Arrangements in Pyrénées”, held in Pau (France) from 11th to 15th of June, 2012. Definition. Let S be a finite set. A Coxeter matrix on S is a square matrix M = (ms,t)s,t∈S indexed by the elements of S and satisfying: (a) ms,s = 1 for all s ∈ S; (b) ms,t = mt,s ∈ {2, 3, 4, . . . } ∪ {∞} for all s, t ∈ S, s 6= t. A Coxeter matrix is u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2012
ISSN: 1077-8926
DOI: 10.37236/2610